Efficient Model Based Diagnosis with Maximum Satisfiability
نویسندگان
چکیده
Model-Based Diagnosis (MBD) finds a growing number of uses in different settings, which include software fault localization, debugging of spreadsheets, web services, and hardware designs, but also the analysis of biological systems, among many others. Motivated by these different uses, there have been significant improvements made to MBD algorithms in recent years. Nevertheless, the analysis of larger and more complex systems motivates further improvements to existing approaches. This paper proposes a novel encoding of MBD into maximum satisfiability (MaxSAT). The new encoding builds on recent work on using Propositional Satisfiability (SAT) for MBD, but identifies a number of key optimizations that are very effective in practice. The paper also proposes a new set of challenging MBD instances, which can be used for evaluating new MBD approaches. Experimental results obtained on existing and on the new MBD problem instances, show conclusive performance gains over the current state of the art.
منابع مشابه
Diagnosing Automotive Control Systems Using Abstract Model-Based Diagnosis
The increasing complexity of automotive control systems causes a problem with locating faults during system failures. One reason for this problem is that system components that receive abnormal input data from other components may also output abnormal data, even if they are not in abnormal modes, and consequently many redundant faults are detected in the system. In this paper, we present a diag...
متن کاملSMT-Based Validation of Timed Failure Propagation Graphs
Timed Failure Propagation Graphs (TFPGs) are a formalism used in industry to describe failure propagation in a dynamic partially observable system. TFPGs are commonly used to perform model-based diagnosis. As in any model-based diagnosis approach, however, the quality of the diagnosis strongly depends on the quality of the model. Approaches to certify the quality of the TFPG are limited and mai...
متن کاملAn Efficient Algorithm for Maximum Boolean Satisfiability Based on Unit Propagation, Linear Programming, and Dynamic Weighting
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of clauses in a logical formula. A branch-and-bound algorithm based on the Davis-PutnamLogemann-Loveland procedure (DPLL) is one of the most efficient complete algorithms for solving max-SAT. In this paper, We propose an...
متن کاملAn LTL SAT Encoding for Behavioral Diagnosis
Assisting designers in writing high-quality specifications is an important step towards minimizing product defects and rework efforts. Drawing on the attractive performance of satisfiability solvers, in this paper, we present a SAT encoding that enables an efficient model-based diagnosis of LTL specifications in the context of behavioral samples (traces). The resulting diagnoses at operator lev...
متن کاملA Novel Model-Based Diagnosis Engine: Theory and Applications
Over the past decade, the number of Earth orbiters and deep space probes has grown dramatically and is expected to continue in the future as miniaturization technologies drive spacecraft to become more numerous and more complex. This rate of growth has brought a new focus on autonomous and self-preserving systems that depend on fault diagnosis. Although diagnosis is needed for any autonomous sy...
متن کامل